Ordered and Shared , Linearly - Independent , Variable - Pair Decision Diagramsfor Incompletely Specified
نویسندگان
چکیده
| The paper presents a new kind of decision tree: it is based on nonsingular expansions for pairs of variables. Such trees are next used to create Linearly Independent (LI) Decision Diagrams (LI DDs). There are 840 nonsigular expansions for a pair of variables, so number of nodes in such (exact) diagrams is never larger than that of trees with single-variable Shannon, Positive Davio, and Negative Davio expansions. The LI Diagrams are a starting point in a synthesis of multilevel AND/OR/EXOR circuits and can potentially achieve better results than the well-known Pseudo-Kronecker Functional Decision Diagrams. They introduce also other gates than AND and EXOR to synthesis.
منابع مشابه
Symbolic incompletely specified functions for correct evaluation in the presence of indeterminate input values
We describe the Ordered Ternary Decision Diagram (OTDD) which can be directly evaluated even when given any number of undefined input logic values. Based on Kleeneon strong ternary logic, the OTDD unifies the concepts of “unknown input” with “don’t-care output” for incompletely-specified Boolean functions. The OTDD permits functions having nontrivial don’t-care sets to be represented as single ...
متن کاملFunction-driven Linearly Independent Expansions of Boolean Functions
The paper presents a family of new expansions of Boolean functions called Function-driven Linearly Independent (fLI) expansions. On the basis of this expansion a new kind of a canonical representation of Boolean functions is constructed: Function-driven Linearly Independent Binary Decision Diagrams (fLIBDDs). They generalize both Function-driven Shannon Binary Decision Diagrams (fShBDDs) and Li...
متن کاملFinding Small OBDDs for Incompletely Specified Truth Tables Is Hard
We present an efficient reduction mapping undirected graphs G with n = 2 vertices for integers k to tables of partially specified Boolean functions g : {0, 1} → {0, 1,⊥} so that for any integer m, G has a vertex colouring using m colours if and only if g has a consistent ordered binary decision diagram with at most (2m+2)n +4n decision nodes. From this it follows that the problem of finding a m...
متن کاملExact Minimization of Fixed Polarity Reed-Muller Expressions for Incompletely Speci ed Functions
This paper presents an exact minimization algorithm for fixed polarity Reed-Muller expressions (FPRMs) for incompletely specified functions. For an n-variable function with unspecified minterms there are 2 distinct FPRMs. A minimum FPRM is one with the fewest products. The minimization algorithm is based on the multi-terminal binary decision diagrams. Experimental results for a set of functions...
متن کاملRough Set Strategies to Data with Missing Attribute Values
In this paper we assume that a data set is presented in the form of the incompletely specified decision table, i.e., some attribute values are missing. Our next basic assumption is that some of the missing attribute values are lost (e.g., erased) and some are "do not care" conditions (i.e., they were redundant or not necessary to make a decision or to classify a case). Incompletely specified de...
متن کامل